Unification theory
Identifieur interne : 00DD57 ( Main/Exploration ); précédent : 00DD56; suivant : 00DD58Unification theory
Auteurs : Jörg H. Siekmann [Allemagne]Source :
- Decision Support Systems [ 0167-9236 ] ; 1990.
English descriptors
- Teeft :
- Abelian group theory, Academic press, Addison wesley, Additional proviso, Algebra, Algorithm, American math, Artificial intelligence, Associativity, Associativity axiom, Autom, Axiom, Canonical, Central operation, Certain equational axioms, Cognitive science, Collapse equations, Commutativity, Comp, Complete sets, Computational, Computational logic, Computational treatment, Computer algebra, Computer science, Computer vision, Conf, Congruence relation, Contemporary mathematics, Data base, Datastructure multisets, Decidable theory, Decision procedures, Deduction system, Deduction systems, Deductive machinery, Different function symbols, Different theories, Diophantine, Diophantine equations, Early history, Efficient unification algorithm, Empty theory, Equational, Equational logic, Equational theories, Equational theory, Essex university, Expert systems, Finitary, Finitary theories, Finitary theory, First order terms, First order unification, Force cambridge research labs, Formal language theory, Free algebra, Free semigroup, Free terms, Function symbol, Function symbols, Functional programming, General representative, General theory, General unifier, General unifiers, Graph isomorphism, Higher order logic, Higher order terms, Higher order unification, Huet, Idempotent functions, Idempotent semigroups, Important role, Inference rules, Infinitary, Infinitary equational theories, Infinitary theories, Infinitary theory, Influential paper, Input sentence, Invocation patterns, Jacm, Karlsruhe, Lankford, Linear algorithm, Logic programming, Logic programming languages, Louisiana techn, Machine intelligence, Mcgraw hill, Minimal unification algorithm, Monoid problem, Natural language processing, Nauk sssr, Nullary, Numerous applications, Other hand, Other words, Paramodulation, Pointer structure, Predicate logic, Prentice hall, Proc, Programming, Programming languages, Proof procedure, Refutation completeness, Regular finitary collapse, Resolution principle, Robinson unification problem, Same function symbol, Scientific report, Semigroup, Semigroup theory, Separate algorithms, Siekmann, Siekmann unification theo, Siekmann unification theoo, Siekmann unification theory, Soviet math, Space limitations, Special case, Special purpose algorithm, Springer, Springer lecture notes, Springer lecture notes comp, Springer verlag, Stickel, Stringunification problem, Strong incentive, Substitution, Symbolic manipulation, Szabo, Techn, Tenth problem, Term algebra, Traditional equation, Traditional programming languages, Transformation rules, Type conformal algorithm, Type nullary, Undecidability, Unification, Unification algorithm, Unification algorithms, Unification computation, Unification grammars, Unification hierarchy, Unification problem, Unification problems, Unification result, Unification theory, Unifier, Unifiers, Unitary, Unitary unification theories, Univ, Universal algebra, Universal turing machine, Universal unification, Universal unification algorithm, Universal unification algorithms, Universal unification theory, West germany, Whole class, World equations.
Abstract
Abstract: This article surveys what is presently known in Unification Theory and records it early history.
Url:
DOI: 10.1016/0167-9236(90)90027-O
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001C14
- to stream Istex, to step Curation: 001B93
- to stream Istex, to step Checkpoint: 003163
- to stream Main, to step Merge: 00E637
- to stream Main, to step Curation: 00DD57
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Unification theory</title><author><name sortKey="Siekmann, Jorg H" sort="Siekmann, Jorg H" uniqKey="Siekmann J" first="Jörg H." last="Siekmann">Jörg H. Siekmann</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:79D008237F4C3408AA54EDB6320F5334C7A17278</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1016/0167-9236(90)90027-O</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-KXSDZSWB-N/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001C14</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001C14</idno><idno type="wicri:Area/Istex/Curation">001B93</idno><idno type="wicri:Area/Istex/Checkpoint">003163</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003163</idno><idno type="wicri:Area/Main/Merge">00E637</idno><idno type="wicri:Area/Main/Curation">00DD57</idno><idno type="wicri:Area/Main/Exploration">00DD57</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Unification theory</title><author><name sortKey="Siekmann, Jorg H" sort="Siekmann, Jorg H" uniqKey="Siekmann J" first="Jörg H." last="Siekmann">Jörg H. Siekmann</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Universität Kaiserslautern, D-6750 Kaiserslautern</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Kaiserslautern</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Decision Support Systems</title><title level="j" type="abbrev">DECSUP</title><idno type="ISSN">0167-9236</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1990">1990</date><biblScope unit="volume">6</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="315">315</biblScope><biblScope unit="page" to="337">337</biblScope></imprint><idno type="ISSN">0167-9236</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-9236</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Abelian group theory</term><term>Academic press</term><term>Addison wesley</term><term>Additional proviso</term><term>Algebra</term><term>Algorithm</term><term>American math</term><term>Artificial intelligence</term><term>Associativity</term><term>Associativity axiom</term><term>Autom</term><term>Axiom</term><term>Canonical</term><term>Central operation</term><term>Certain equational axioms</term><term>Cognitive science</term><term>Collapse equations</term><term>Commutativity</term><term>Comp</term><term>Complete sets</term><term>Computational</term><term>Computational logic</term><term>Computational treatment</term><term>Computer algebra</term><term>Computer science</term><term>Computer vision</term><term>Conf</term><term>Congruence relation</term><term>Contemporary mathematics</term><term>Data base</term><term>Datastructure multisets</term><term>Decidable theory</term><term>Decision procedures</term><term>Deduction system</term><term>Deduction systems</term><term>Deductive machinery</term><term>Different function symbols</term><term>Different theories</term><term>Diophantine</term><term>Diophantine equations</term><term>Early history</term><term>Efficient unification algorithm</term><term>Empty theory</term><term>Equational</term><term>Equational logic</term><term>Equational theories</term><term>Equational theory</term><term>Essex university</term><term>Expert systems</term><term>Finitary</term><term>Finitary theories</term><term>Finitary theory</term><term>First order terms</term><term>First order unification</term><term>Force cambridge research labs</term><term>Formal language theory</term><term>Free algebra</term><term>Free semigroup</term><term>Free terms</term><term>Function symbol</term><term>Function symbols</term><term>Functional programming</term><term>General representative</term><term>General theory</term><term>General unifier</term><term>General unifiers</term><term>Graph isomorphism</term><term>Higher order logic</term><term>Higher order terms</term><term>Higher order unification</term><term>Huet</term><term>Idempotent functions</term><term>Idempotent semigroups</term><term>Important role</term><term>Inference rules</term><term>Infinitary</term><term>Infinitary equational theories</term><term>Infinitary theories</term><term>Infinitary theory</term><term>Influential paper</term><term>Input sentence</term><term>Invocation patterns</term><term>Jacm</term><term>Karlsruhe</term><term>Lankford</term><term>Linear algorithm</term><term>Logic programming</term><term>Logic programming languages</term><term>Louisiana techn</term><term>Machine intelligence</term><term>Mcgraw hill</term><term>Minimal unification algorithm</term><term>Monoid problem</term><term>Natural language processing</term><term>Nauk sssr</term><term>Nullary</term><term>Numerous applications</term><term>Other hand</term><term>Other words</term><term>Paramodulation</term><term>Pointer structure</term><term>Predicate logic</term><term>Prentice hall</term><term>Proc</term><term>Programming</term><term>Programming languages</term><term>Proof procedure</term><term>Refutation completeness</term><term>Regular finitary collapse</term><term>Resolution principle</term><term>Robinson unification problem</term><term>Same function symbol</term><term>Scientific report</term><term>Semigroup</term><term>Semigroup theory</term><term>Separate algorithms</term><term>Siekmann</term><term>Siekmann unification theo</term><term>Siekmann unification theoo</term><term>Siekmann unification theory</term><term>Soviet math</term><term>Space limitations</term><term>Special case</term><term>Special purpose algorithm</term><term>Springer</term><term>Springer lecture notes</term><term>Springer lecture notes comp</term><term>Springer verlag</term><term>Stickel</term><term>Stringunification problem</term><term>Strong incentive</term><term>Substitution</term><term>Symbolic manipulation</term><term>Szabo</term><term>Techn</term><term>Tenth problem</term><term>Term algebra</term><term>Traditional equation</term><term>Traditional programming languages</term><term>Transformation rules</term><term>Type conformal algorithm</term><term>Type nullary</term><term>Undecidability</term><term>Unification</term><term>Unification algorithm</term><term>Unification algorithms</term><term>Unification computation</term><term>Unification grammars</term><term>Unification hierarchy</term><term>Unification problem</term><term>Unification problems</term><term>Unification result</term><term>Unification theory</term><term>Unifier</term><term>Unifiers</term><term>Unitary</term><term>Unitary unification theories</term><term>Univ</term><term>Universal algebra</term><term>Universal turing machine</term><term>Universal unification</term><term>Universal unification algorithm</term><term>Universal unification algorithms</term><term>Universal unification theory</term><term>West germany</term><term>Whole class</term><term>World equations</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This article surveys what is presently known in Unification Theory and records it early history.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Kaiserslautern</li></settlement></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Siekmann, Jorg H" sort="Siekmann, Jorg H" uniqKey="Siekmann J" first="Jörg H." last="Siekmann">Jörg H. Siekmann</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DD57 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DD57 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:79D008237F4C3408AA54EDB6320F5334C7A17278
|texte= Unification theory
}}
| This area was generated with Dilib version V0.6.33. |  |